Advanced Indexing Operations on Substitution Trees
نویسندگان
چکیده
Indexing techniques support the retrieval and maintenance of large sets of terms There is also an indexing method called substi tution tree indexing that e ciently handles sets of substitutions We present three advanced indexing operations for substitution trees The multi merge for the simultaneous uni cation of sets of substitutions the subsumption operation on two sets of substitutions and the selection of lightest substitutions of a set of substitutions The indexing operations can be combined to obtain powerful reasoning tools for theorem provers
منابع مشابه
Substitution Tree Indexing
The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) a given query term. In this paper a new indexing method is presented, which outperforms traditional methods such as path indexing, discrimination tree indexing and abstraction trees. Additionally, the new index n...
متن کاملA Content Based Mathematical Search Engine: Whelp
The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The prototype — called Whelp — exploits a metadata approach for indexing the information that looks far more flexible than traditional indexing techniques for structured expressions like substitution, discrimination, or context tre...
متن کاملLayout-based substitution tree indexing and retrieval for mathematical expressions
We introduce a new system for layout-based (LTEX) indexing and retrieving mathematical expressions using substitution trees. Substitution trees can efficiently store and find expressions based on the similarity of their symbols, symbol layout, sub-expressions and size. We describe our novel design and some of our contributions to the substitution tree indexing and retrieval algorithms. We provi...
متن کاملJoining of Decorated Trees
This is the continuation of the sequence of articles on trees (see [2], [4], [5]). The main goal is to introduce joining operations on decorated trees corresponding with operations introduced in [5]. We will also introduce the operation of substitution. In the last section we dealt with trees decorated by Cartesian product, i.e. we showed some lemmas on joining operations applied to such trees.
متن کاملContext Trees
Indexing data structures have a crucial impact on the performance of automated theorem provers. Examples are discrimination trees, which are like tries where terms are seen as strings and common prefixes are shared, and substitution trees, where terms keep their tree structure and all common contexts can be shared. Here we describe a new indexing data structure, called context trees, where, by ...
متن کامل